Threshold-based Partial Sharing Buffer Management in a Shared Buffer Packet Switch

نویسندگان

  • Ruey-Bin Yang
  • Ming-Cheng Liang
  • Yuan-Sun Chu
  • Cheng-Shong Wu
چکیده

In a shared buffer packet switch, a good buffer management scheme will reduce the overall packet loss probability and improve the fairness among different output queues. In this paper, a novel buffer control scheme called threshold-based partial sharing (TPS) is proposed. The key idea of the TPS is to separate the output ports into active and inactive output ports according to whether their queue lengths are larger than the fair buffer allocation factor or not. When the remained buffer size is larger than a certain threshold value, all arrival packets are accepted. Otherwise, only the packets destined for inactive output ports are admitted to enter the shard buffer. The TPS scheme possesses the dynamic adjustability of pushout (PO) without the implementation complexity. Instead, the TPS uses a simple static threshold for control. Computer simulations are used to compare the loss performance of TPS, dynamic threshold (DT), and PO. TPS control is shown to be more robust to variation in traffic conditions than DT control and close to the loss performance of PO that is considered as optimal in terms of fairness and overall packet loss probability. key words: threshold, partial sharing, fairness, robust

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Sharing and Partial Partitioning Buffer Management Scheme for Shared Buffer Packet Switches

In a shared buffer packet switch, a good buffer management scheme is needed to reduce the overall packet loss probability and improve the fairness between different users. In this paper, a novel buffer control scheme called partial sharing and partial partitioning (PSPP) is proposed. The PSPP is an adaptive scheme that can be dynamically adjusted to the changing traffic conditions while simple ...

متن کامل

Sigmoid Function Based Dynamic Threshold Scheme for Shared-Buffer Switches

Buffer space in packet switching nodes is an important network resource. Shared buffer switches are prone to high packet losses and unfair use of buffer space. The use of a buffer management scheme is necessary to overcome these problems. This paper investigates the performance of Sigmoid Function Threshold scheme by means of simulations. This scheme regulates the usage of shared buffer space b...

متن کامل

Exponential Decay Queue Thresholds for Optimal Buffer Sharing

In an N x N shared buffer switch architecture, a common buffer space is shared among output ports, which provides flexibility in resource allocation. However the problem arises when the buffer space is dominated by one or more output ports in case of imbalanced input traffic. Thus this results in an increased packet loss rates due to unfair sharing of buffer space. For this reason buffer manage...

متن کامل

Buffer Management in the Sliding-Window (SW) Packet Switch for Priority Switching

Switch and router architectures employing a shared buffer are known to provide high throughput, low delay, and high memory utilization. Superior performance of a shared-memory switch compared to switches employing other buffer strategies can be achieved by carefully implementing a buffer-management scheme. A buffer-sharing policy should allow all of the output interfaces to have fair and robust...

متن کامل

Prioritized Buffer Management in Photonic Packet Switches for Synchronously Arriving Fixed-length Packets

We investigate a photonic packet switch architecture that enables a high node throughput and provides priority services. We describe PBSO (partial buffer sharing with overwriting) method that allows control of an optical fiber-delay-line buffer by prioritized buffer management under conditions of synchronous arrival of fixed length optical packets at a packet switch. The PBSO method is based on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002